<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SystemSharp: GraphAlgorithmLib.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">SystemSharp
   &#160;<span id="projectnumber">0.3</span>
   </div>
   <div id="projectbrief">A system-level modeling framework for designing real-time embedded systems</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Packages</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('_graph_algorithm_lib_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Properties</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Events</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">GraphAlgorithmLib.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_graph_algorithm_lib_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#pragma once</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">using namespace </span>System;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">using namespace </span>System::Collections::Generic;</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html">   29</a></span>&#160;<span class="keyword">namespace </span>GraphAlgorithms {</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">   31</a></span>&#160;    <span class="keyword">typedef</span> adjacency_list&lt;vecS, vecS, undirectedS&gt; <a class="code" href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">graph_t</a>;</div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#aedecdba1cbd5f4bb0ebb106cc1a7c738">   32</a></span>&#160;    <span class="keyword">typedef</span> graph_traits&lt;graph_t&gt;::vertex_descriptor <a class="code" href="namespace_graph_algorithms.html#aedecdba1cbd5f4bb0ebb106cc1a7c738">vertex_t</a>;</div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#a925bd8a1e2137d17eebd2edd17362533">   33</a></span>&#160;    <span class="keyword">typedef</span> std::vector&lt;vertex_t&gt; <a class="code" href="namespace_graph_algorithms.html#a925bd8a1e2137d17eebd2edd17362533">vertex_vec_t</a>;</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">   35</a></span>&#160;    <span class="keyword">typedef</span> adjacency_list&lt;vecS, vecS, bidirectionalS&gt; <a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>;</div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#a3f61d79af9606afe16a840805bee2976">   36</a></span>&#160;    <span class="keyword">typedef</span> graph_traits&lt;digraph_t&gt;::vertex_descriptor <a class="code" href="namespace_graph_algorithms.html#a3f61d79af9606afe16a840805bee2976">divertex_t</a>;</div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="namespace_graph_algorithms.html#ad36d55186418d05260ace4c34dd641bf">   37</a></span>&#160;    <span class="keyword">typedef</span> std::vector&lt;divertex_t&gt; <a class="code" href="namespace_graph_algorithms.html#ad36d55186418d05260ace4c34dd641bf">divertex_vec_t</a>;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    <span class="keyword">ref class</span> <a class="code" href="class_graph_algorithms_1_1_graph.html">Graph</a>;</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">ref class</span> <a class="code" href="class_graph_algorithms_1_1_digraph.html">Digraph</a>;</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html">   44</a></span>&#160;    <span class="keyword">public ref class</span> <a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a></div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    {</div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html#a9f0293cd569b80f007f375e0a71ec04f">   46</a></span>&#160;        !<a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a>()</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        {</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            <span class="keyword">delete</span> m_pMate;</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        }</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <span class="keyword">internal</span>:</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a>(<a class="code" href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">graph_t</a>* pg)</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        {</div>
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html#af19f78f5fa4b877414ca9fab22003b7e">   55</a></span>&#160;            m_pMate = <span class="keyword">new</span> mate_t(num_vertices(*pg));</div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html#ae51e38434b517c05ab709fec86fbf5a4">   56</a></span>&#160;            m_result =</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;                checked_edmonds_maximum_cardinality_matching(*pg, &amp;(*m_pMate)[0]);</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        }</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keyword">typedef</span> <a class="code" href="namespace_graph_algorithms.html#a925bd8a1e2137d17eebd2edd17362533">vertex_vec_t</a> mate_t;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    <span class="keyword">public</span>:</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> <span class="keywordflow">default</span>[int]</div>
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html#a31e5e41e00ec396f5f8a8079f8d59108">   66</a></span>&#160;        {</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;            {</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                <span class="keywordflow">if</span> (v &lt; 0 || v &gt;= (<span class="keywordtype">int</span>)m_pMate-&gt;size())</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;                    <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="keywordflow">if</span> ((*m_pMate)[v] == graph_traits&lt;graph_t&gt;::null_vertex())</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                    <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                    <span class="keywordflow">return</span> (*m_pMate)[v];</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            }</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        }</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">bool</span> IsMaximumCardinality              </div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        {</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordtype">bool</span> <span class="keyword">get</span>()</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            {</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                <span class="keywordflow">return</span> m_result;</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            }</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        }</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        std::vector&lt;graph_traits&lt;graph_t&gt;::vertex_descriptor&gt;*</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                    m_pMate;</div>
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_matching.html#a6776847a67fbc1c293971bc130ce550f">   90</a></span>&#160;        <span class="keywordtype">bool</span>        <a class="code" href="class_graph_algorithms_1_1_matching.html#a6776847a67fbc1c293971bc130ce550f">m_result</a>;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    };</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div>
<div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html">   95</a></span>&#160;    <span class="keyword">public ref class</span> <a class="code" href="class_graph_algorithms_1_1_strong_components.html">StrongComponents</a></div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    {   </div>
<div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a0706c7b979fa5aaf23c8b4d355be7e3a">   97</a></span>&#160;        !<a class="code" href="class_graph_algorithms_1_1_strong_components.html">StrongComponents</a>()</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        {</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="keyword">delete</span> m_pComponent;</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            <span class="keyword">delete</span> m_pDiscoverTime;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;            <span class="keyword">delete</span> m_pColor;</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            <span class="keyword">delete</span> m_pRoot;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        }</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    <span class="keyword">internal</span>:</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        <a class="code" href="class_graph_algorithms_1_1_strong_components.html">StrongComponents</a>(<a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>* pg)</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        {</div>
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a21b6a7726c1642a7d230bc51daab7038">  109</a></span>&#160;            <span class="keywordtype">int</span> nv = num_vertices(*pg);</div>
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#aeec6f3144aca860ed5e882ac372d011d">  110</a></span>&#160;            m_pComponent = <span class="keyword">new</span> ivec_t(nv);</div>
<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a5f3d8e41f3ba67b6ad5ea402feffb738">  111</a></span>&#160;            m_pDiscoverTime = <span class="keyword">new</span> ivec_t(nv);</div>
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a83f8bd17c07de13a24c3df110ceccab8">  112</a></span>&#160;            m_pColor = <span class="keyword">new</span> cvec_t(nv);</div>
<div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a1167e6009b924e90d1d62dc43af2c970">  113</a></span>&#160;            m_pRoot = <span class="keyword">new</span> <a class="code" href="namespace_graph_algorithms.html#ad36d55186418d05260ace4c34dd641bf">divertex_vec_t</a>(nv);</div>
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#ae60fd0d4f944ab4bbc1e59261b14fa91">  114</a></span>&#160;            m_num = strong_components(*pg, &amp;((*m_pComponent)[0]), </div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                              root_map(&amp;((*m_pRoot)[0])).</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                              color_map(&amp;((*m_pColor)[0])).</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                              discover_time_map(&amp;((*m_pDiscoverTime)[0])));</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        }</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keyword">typedef</span> std::vector&lt;int&gt; ivec_t;</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keyword">typedef</span> std::vector&lt;default_color_type&gt; cvec_t;</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    <span class="keyword">public</span>:</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> NumComponents</div>
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#aa97409ecce0b7e9feffb971445dba77c">  127</a></span>&#160;        {</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>()</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;            {</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                <span class="keywordflow">return</span> m_num;</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            }</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        }</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> <span class="keywordflow">default</span>[int]</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        {</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            {</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="keywordflow">if</span> (v &lt; 0 || v &gt;= (<span class="keywordtype">int</span>)m_pComponent-&gt;size())</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    <span class="keywordflow">return</span> (*m_pComponent)[v];</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            }</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        }</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;        <span class="keywordtype">int</span>                 m_num;</div>
<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a7d88932666224874e436c8d8e60d2862">  148</a></span>&#160;        ivec_t*             <a class="code" href="class_graph_algorithms_1_1_strong_components.html#a7d88932666224874e436c8d8e60d2862">m_pComponent</a>;</div>
<div class="line"><a name="l00149"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a9546a70bf4607bfc892fcc378949ad8b">  149</a></span>&#160;        ivec_t*             <a class="code" href="class_graph_algorithms_1_1_strong_components.html#a9546a70bf4607bfc892fcc378949ad8b">m_pDiscoverTime</a>;</div>
<div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a0d20884add42b0ada2559550e878f336">  150</a></span>&#160;        cvec_t*             <a class="code" href="class_graph_algorithms_1_1_strong_components.html#a0d20884add42b0ada2559550e878f336">m_pColor</a>;</div>
<div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_strong_components.html#a982b9aacadc33a6de932c537b6d58c08">  151</a></span>&#160;        <a class="code" href="namespace_graph_algorithms.html#ad36d55186418d05260ace4c34dd641bf">divertex_vec_t</a>*     <a class="code" href="class_graph_algorithms_1_1_strong_components.html#a982b9aacadc33a6de932c537b6d58c08">m_pRoot</a>;</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    };</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;</div>
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_topological_sorting.html">  156</a></span>&#160;    <span class="keyword">public ref class</span> <a class="code" href="class_graph_algorithms_1_1_topological_sorting.html">TopologicalSorting</a></div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    {</div>
<div class="line"><a name="l00158"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_topological_sorting.html#a8a7bf78ae0d26c5732e198cf7bdae902">  158</a></span>&#160;        !<a class="code" href="class_graph_algorithms_1_1_topological_sorting.html">TopologicalSorting</a>()</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        {</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;            <span class="keyword">delete</span> m_pOrder;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        }</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    <span class="keyword">internal</span>:</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <a class="code" href="class_graph_algorithms_1_1_topological_sorting.html">TopologicalSorting</a>(<a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>* pg)</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        {</div>
<div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_topological_sorting.html#a80b917f6538d6184267c820d21e7079c">  167</a></span>&#160;            <span class="keywordtype">int</span> nv = num_vertices(*pg);</div>
<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_topological_sorting.html#ac29d1bfaf280cb73896259e4f81e3f36">  168</a></span>&#160;            m_pOrder = <span class="keyword">new</span> std::deque&lt;int&gt;(nv);</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            topological_sort(*pg, </div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                std::front_inserter(*m_pOrder),</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                vertex_index_map(identity_property_map()));</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        }</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    <span class="keyword">public</span>:</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> NumVertices</div>
<div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_topological_sorting.html#a777843c372d36d6d58546c612c402bca">  177</a></span>&#160;        {</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>()</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;            {</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                <span class="keywordflow">return</span> m_pOrder-&gt;size();</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            }</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        }</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> <span class="keywordflow">default</span>[int]</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        {</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>(<span class="keywordtype">int</span> idx)</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;            {</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                <span class="keywordflow">if</span> (idx &lt; 0 || idx &gt;= (<span class="keywordtype">int</span>)m_pOrder-&gt;size())</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                    <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                    <span class="keywordflow">return</span> (*m_pOrder)[idx];</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;            }</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        }</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;        std::deque&lt;int&gt;*        m_pOrder;</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;    };</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;</div>
<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_graph.html">  201</a></span>&#160;    <span class="keyword">public ref class</span> <a class="code" href="class_graph_algorithms_1_1_graph.html">Graph</a></div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;    {</div>
<div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_graph.html#ad2a9743b136f23f0eee84db05c336944">  203</a></span>&#160;        !<a class="code" href="class_graph_algorithms_1_1_graph.html">Graph</a>()</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        {</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;            <span class="keyword">delete</span> m_pGraph;</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        }</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    <span class="keyword">public</span>:</div>
<div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_graph.html#a5dceb18b739d5f9ef33f7f26db9725da">  210</a></span>&#160;        <a class="code" href="class_graph_algorithms_1_1_graph.html#a5dceb18b739d5f9ef33f7f26db9725da">Graph</a>(<span class="keywordtype">int</span> numVertices)</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        {</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            m_pGraph = <span class="keyword">new</span> <a class="code" href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">graph_t</a>(numVertices);</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        }</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;</div>
<div class="line"><a name="l00218"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_graph.html#a13e73e22b30b75eec74b0c2e2e25399f">  218</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="class_graph_algorithms_1_1_graph.html#a13e73e22b30b75eec74b0c2e2e25399f">AddEdge</a>(<span class="keywordtype">int</span> v1, <span class="keywordtype">int</span> v2)</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        {</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            add_edge(v1, v2, *m_pGraph);</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        }</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;</div>
<div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_graph.html#adfe3585a05c8a5237fadabfe72dc66c1">  225</a></span>&#160;        <a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a>^ <a class="code" href="class_graph_algorithms_1_1_graph.html#adfe3585a05c8a5237fadabfe72dc66c1">GetMaximumMatching</a>()</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        {</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;            <a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a>^ match = <span class="keyword">gcnew</span> <a class="code" href="class_graph_algorithms_1_1_matching.html">Matching</a>(m_pGraph);</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;            <span class="keywordflow">return</span> match;</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        }</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <a class="code" href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">graph_t</a>*    m_pGraph;       </div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    };</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;</div>
<div class="line"><a name="l00236"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_digraph.html">  236</a></span>&#160;    <span class="keyword">public ref class</span> <a class="code" href="class_graph_algorithms_1_1_digraph.html">Digraph</a></div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    {</div>
<div class="line"><a name="l00238"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_digraph.html#a760ef6def94dd4cdb7f86ce8564723e1">  238</a></span>&#160;        !<a class="code" href="class_graph_algorithms_1_1_digraph.html">Digraph</a>()</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        {</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;            <span class="keyword">delete</span> m_pGraph;</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        }</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;    <span class="keyword">public</span>:</div>
<div class="line"><a name="l00245"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_digraph.html#a145befb618c59ee8818b812ee22aa49c">  245</a></span>&#160;        <a class="code" href="class_graph_algorithms_1_1_digraph.html#a145befb618c59ee8818b812ee22aa49c">Digraph</a>()</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        {</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;            m_pGraph = <span class="keyword">new</span> <a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>();</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        }</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;</div>
<div class="line"><a name="l00251"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_digraph.html#acac5fc22157635b39e5af25335218a75">  251</a></span>&#160;        <a class="code" href="class_graph_algorithms_1_1_digraph.html#acac5fc22157635b39e5af25335218a75">Digraph</a>(<span class="keywordtype">int</span> numVertices)</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        {</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;            m_pGraph = <span class="keyword">new</span> <a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>(numVertices);</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        }</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> NumVertices</div>
<div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="class_graph_algorithms_1_1_digraph.html#a14b73c3d54585a5e4b267e1f0f91ea9f">  258</a></span>&#160;        {</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>()</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;            {</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;                <span class="keywordflow">return</span> num_vertices(*m_pGraph);</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;            }</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;        }</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keyword">property</span> <span class="keywordtype">int</span> NumEdges</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        {</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            <span class="keywordtype">int</span> <span class="keyword">get</span>()</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            {</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                <span class="keywordflow">return</span> num_edges(*m_pGraph);</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;            }</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        }</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        <span class="keywordtype">int</span> AddNode()</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        {</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;            <span class="keywordflow">return</span> add_vertex(*m_pGraph);</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        }</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        <span class="keywordtype">void</span> AddEdge(<span class="keywordtype">int</span> v1, <span class="keywordtype">int</span> v2)</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        {</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;            add_edge(v1, v2, *m_pGraph);</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;        }</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;        <span class="keywordtype">int</span> GetOutDegree(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        {</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;            <span class="keywordflow">return</span> out_degree(v, *m_pGraph);</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        }</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordtype">int</span> GetInDegree(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        {</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="keywordflow">return</span> in_degree(v, *m_pGraph);</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        }</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        List&lt;int&gt;^ GetOutSet(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        {</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            List&lt;int&gt;^ result = <span class="keyword">gcnew</span> List&lt;int&gt;;</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            graph_traits&lt;digraph_t&gt;::out_edge_iterator vi, vi_end;</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;            <span class="keywordflow">for</span> (boost::tie(vi,vi_end) = out_edges(v, *m_pGraph); vi != vi_end; ++vi)</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;            {</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                result-&gt;Add(target(*vi, *m_pGraph));</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            }</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;        }</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        List&lt;int&gt;^ GetInSet(<span class="keywordtype">int</span> v)</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        {</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;            List&lt;int&gt;^ result = <span class="keyword">gcnew</span> List&lt;int&gt;;</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;            graph_traits&lt;digraph_t&gt;::in_edge_iterator vi, vi_end;</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;            <span class="keywordflow">for</span> (boost::tie(vi,vi_end) = in_edges(v, *m_pGraph); vi != vi_end; ++vi)</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;            {</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;                result-&gt;Add(source(*vi, *m_pGraph));</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;            }</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        }</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        StrongComponents^ GetStrongComponents()</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        {</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;            StrongComponents^ sc = <span class="keyword">gcnew</span> StrongComponents(m_pGraph);</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;            <span class="keywordflow">return</span> sc;</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;        }</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        TopologicalSorting^ GetTopologicalSorting()</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        {</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;            TopologicalSorting^ ts = <span class="keyword">gcnew</span> TopologicalSorting(m_pGraph);</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;            <span class="keywordflow">return</span> ts;</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;        }</div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;    <span class="keyword">private</span>:</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        <a class="code" href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">digraph_t</a>*  m_pGraph;       </div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;    };</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;}</div>
<div class="ttc" id="namespace_graph_algorithms_html_a925bd8a1e2137d17eebd2edd17362533"><div class="ttname"><a href="namespace_graph_algorithms.html#a925bd8a1e2137d17eebd2edd17362533">GraphAlgorithms::vertex_vec_t</a></div><div class="ttdeci">std::vector&lt; vertex_t &gt; vertex_vec_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00033">GraphAlgorithmLib.h:33</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_digraph_html_acac5fc22157635b39e5af25335218a75"><div class="ttname"><a href="class_graph_algorithms_1_1_digraph.html#acac5fc22157635b39e5af25335218a75">GraphAlgorithms::Digraph::Digraph</a></div><div class="ttdeci">Digraph(int numVertices)</div><div class="ttdoc">summary&gt;Current number of vertices</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00251">GraphAlgorithmLib.h:251</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_matching_html"><div class="ttname"><a href="class_graph_algorithms_1_1_matching.html">GraphAlgorithms::Matching</a></div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00044">GraphAlgorithmLib.h:44</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_strong_components_html_a982b9aacadc33a6de932c537b6d58c08"><div class="ttname"><a href="class_graph_algorithms_1_1_strong_components.html#a982b9aacadc33a6de932c537b6d58c08">GraphAlgorithms::StrongComponents::m_pRoot</a></div><div class="ttdeci">divertex_vec_t * m_pRoot</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00151">GraphAlgorithmLib.h:151</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_strong_components_html"><div class="ttname"><a href="class_graph_algorithms_1_1_strong_components.html">GraphAlgorithms::StrongComponents</a></div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00095">GraphAlgorithmLib.h:95</a></div></div>
<div class="ttc" id="namespace_graph_algorithms_html_aedecdba1cbd5f4bb0ebb106cc1a7c738"><div class="ttname"><a href="namespace_graph_algorithms.html#aedecdba1cbd5f4bb0ebb106cc1a7c738">GraphAlgorithms::vertex_t</a></div><div class="ttdeci">graph_traits&lt; graph_t &gt;::vertex_descriptor vertex_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00032">GraphAlgorithmLib.h:32</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_graph_html_adfe3585a05c8a5237fadabfe72dc66c1"><div class="ttname"><a href="class_graph_algorithms_1_1_graph.html#adfe3585a05c8a5237fadabfe72dc66c1">GraphAlgorithms::Graph::GetMaximumMatching</a></div><div class="ttdeci">Matching GetMaximumMatching()</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00225">GraphAlgorithmLib.h:225</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_digraph_html"><div class="ttname"><a href="class_graph_algorithms_1_1_digraph.html">GraphAlgorithms::Digraph</a></div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00236">GraphAlgorithmLib.h:236</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_graph_html_a13e73e22b30b75eec74b0c2e2e25399f"><div class="ttname"><a href="class_graph_algorithms_1_1_graph.html#a13e73e22b30b75eec74b0c2e2e25399f">GraphAlgorithms::Graph::AddEdge</a></div><div class="ttdeci">void AddEdge(int v1, int v2)</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00218">GraphAlgorithmLib.h:218</a></div></div>
<div class="ttc" id="namespace_graph_algorithms_html_a2c6c4766deef082aa06ffc2dea4aab6f"><div class="ttname"><a href="namespace_graph_algorithms.html#a2c6c4766deef082aa06ffc2dea4aab6f">GraphAlgorithms::graph_t</a></div><div class="ttdeci">adjacency_list&lt; vecS, vecS, undirectedS &gt; graph_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00031">GraphAlgorithmLib.h:31</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_matching_html_a6776847a67fbc1c293971bc130ce550f"><div class="ttname"><a href="class_graph_algorithms_1_1_matching.html#a6776847a67fbc1c293971bc130ce550f">GraphAlgorithms::Matching::m_result</a></div><div class="ttdeci">bool m_result</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00090">GraphAlgorithmLib.h:90</a></div></div>
<div class="ttc" id="namespace_graph_algorithms_html_a88e83ab969cdbfb9e9f5b4a21d975786"><div class="ttname"><a href="namespace_graph_algorithms.html#a88e83ab969cdbfb9e9f5b4a21d975786">GraphAlgorithms::digraph_t</a></div><div class="ttdeci">adjacency_list&lt; vecS, vecS, bidirectionalS &gt; digraph_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00035">GraphAlgorithmLib.h:35</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_topological_sorting_html"><div class="ttname"><a href="class_graph_algorithms_1_1_topological_sorting.html">GraphAlgorithms::TopologicalSorting</a></div><div class="ttdoc">summary&gt;An undirected graph. Vertices are represented by integer values.</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00156">GraphAlgorithmLib.h:156</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_graph_html"><div class="ttname"><a href="class_graph_algorithms_1_1_graph.html">GraphAlgorithms::Graph</a></div><div class="ttdoc">summary&gt;A directed graph. Vertices are represented by integer values.</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00201">GraphAlgorithmLib.h:201</a></div></div>
<div class="ttc" id="namespace_graph_algorithms_html_a3f61d79af9606afe16a840805bee2976"><div class="ttname"><a href="namespace_graph_algorithms.html#a3f61d79af9606afe16a840805bee2976">GraphAlgorithms::divertex_t</a></div><div class="ttdeci">graph_traits&lt; digraph_t &gt;::vertex_descriptor divertex_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00036">GraphAlgorithmLib.h:36</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_digraph_html_a145befb618c59ee8818b812ee22aa49c"><div class="ttname"><a href="class_graph_algorithms_1_1_digraph.html#a145befb618c59ee8818b812ee22aa49c">GraphAlgorithms::Digraph::Digraph</a></div><div class="ttdeci">Digraph()</div><div class="ttdoc">Constructs an empty directed graph (vertices/edges can be added afterwards).</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00245">GraphAlgorithmLib.h:245</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_strong_components_html_a0d20884add42b0ada2559550e878f336"><div class="ttname"><a href="class_graph_algorithms_1_1_strong_components.html#a0d20884add42b0ada2559550e878f336">GraphAlgorithms::StrongComponents::m_pColor</a></div><div class="ttdeci">cvec_t * m_pColor</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00150">GraphAlgorithmLib.h:150</a></div></div>
<div class="ttc" id="namespace_graph_algorithms_html_ad36d55186418d05260ace4c34dd641bf"><div class="ttname"><a href="namespace_graph_algorithms.html#ad36d55186418d05260ace4c34dd641bf">GraphAlgorithms::divertex_vec_t</a></div><div class="ttdeci">std::vector&lt; divertex_t &gt; divertex_vec_t</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00037">GraphAlgorithmLib.h:37</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_strong_components_html_a7d88932666224874e436c8d8e60d2862"><div class="ttname"><a href="class_graph_algorithms_1_1_strong_components.html#a7d88932666224874e436c8d8e60d2862">GraphAlgorithms::StrongComponents::m_pComponent</a></div><div class="ttdeci">ivec_t * m_pComponent</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00148">GraphAlgorithmLib.h:148</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_graph_html_a5dceb18b739d5f9ef33f7f26db9725da"><div class="ttname"><a href="class_graph_algorithms_1_1_graph.html#a5dceb18b739d5f9ef33f7f26db9725da">GraphAlgorithms::Graph::Graph</a></div><div class="ttdeci">Graph(int numVertices)</div><div class="ttdoc">Constructs an undirected graph with a given number of vertices.</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00210">GraphAlgorithmLib.h:210</a></div></div>
<div class="ttc" id="class_graph_algorithms_1_1_strong_components_html_a9546a70bf4607bfc892fcc378949ad8b"><div class="ttname"><a href="class_graph_algorithms_1_1_strong_components.html#a9546a70bf4607bfc892fcc378949ad8b">GraphAlgorithms::StrongComponents::m_pDiscoverTime</a></div><div class="ttdeci">ivec_t * m_pDiscoverTime</div><div class="ttdef"><b>Definition:</b> <a href="_graph_algorithm_lib_8h_source.html#l00149">GraphAlgorithmLib.h:149</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_bb5e995590685548b7e11478911ee7c3.html">SystemSharp-Google-SVN</a></li><li class="navelem"><a class="el" href="dir_8deefa4467a62b572b52d238d562b104.html">SystemSharp</a></li><li class="navelem"><a class="el" href="dir_c1541f61030225b9fc2fa8b20c7978c5.html">GraphAlgorithmLib</a></li><li class="navelem"><a class="el" href="_graph_algorithm_lib_8h.html">GraphAlgorithmLib.h</a></li>
    <li class="footer">Generated on Thu Dec 26 2013 14:21:39 for SystemSharp by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
